Supplementary material of NSSRF: global network similarity search with subgraph signatures and its applications
نویسندگان
چکیده
This supplementary material illustrates the related descriptions, definitions, datasets, and experiment results of NSSRF. In addition, the limitation of NSSRF in terms of network size using five PPI networks to query the random forest regression (RFR) model is discussed. Moreover, the practical memory usage of NSSRF on the four real world datasets are illustrated in this supplementary manuscript.
منابع مشابه
Subgraph Similarity Search in Large Graphs
One of the major challenges in applications related to social networks, computational biology, collaboration networks etc., is to efficiently search for similar patterns in their underlying graphs. These graphs are typically noisy and contain thousands of vertices and millions of edges. In many cases, the graphs are unlabeled and the notion of similarity is also not well defined. We study the p...
متن کاملLink Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملEfficient Subgraph Similarity Search on Large Probabilistic Graph Databases
Many studies have been conducted on seeking the efficient solution for subgraph similarity search over certain (deterministic) graphs due to its wide application in many fields, including bioinformatics, social network analysis, and Resource Description Framework (RDF) data management. All these works assume that the underlying data are certain. However, in reality, graphs are often noisy and u...
متن کاملSupplementary Material: C–GRAAL: Common–Neighbors–Based Global GRAph ALignment of Biological Networks†
To determine topological similarity between two nodes in different networks, we use the similarity measure of nodes’ local neighborhoods, as described by Milenković and Pržulj1. This measure generalizes the degree of a node, which counts the number of edges that the node touches, into the vector of graphlet degrees, that counts the number of graphlets that the node touches, for all 2-5-node gra...
متن کاملA Robust Competitive Global Supply Chain Network Design under Disruption: The Case of Medical Device Industry
In this study, an optimization model is proposed to design a Global Supply Chain (GSC) for a medical device manufacturer under disruption in the presence of pre-existing competitors and price inelasticity of demand. Therefore, static competition between the distributors’ facilities to more efficiently gain a further share in market of Economic Cooperation Organization trade agreement (ECOTA) is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016